Effective Top-k Keyword Search in Relational Databases Considering Query Semantics
نویسندگان
چکیده
Keyword search in relational databases has recently emerged as a new research topic. As a search result is often assembled from multiple relational tables, existing IR-style ranking strategies can not be applied directly. In this paper, we propose a novel IR ranking strategy considering query semantics for effective keyword search. The experimental results on a large-scale real database demonstrate that our method results in significant improvement in terms of retrieval effectiveness as compared to previous ranking strategies.
منابع مشابه
Scalable Continual Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years because it does not require users neither to master a certain structured query language nor to know the complex underlying database schemas. Most of existing methods focus on answering snapshot keyword queries in static databases. In practice, however, databases are updated frequently, and users may have long-term in...
متن کاملJoin-Based Algorithms for Keyword Search in XML Databases
We consider the problem of keyword search in XML databases under the excluding lowest common ancestor (ELCA) semantics. Our analysis shows that ELCA semantics may lead to conflict with keyword proximity concept, and under such semantics, lower ELCAs are preferable because lower elements tend to be more specific. However, existing algorithms (stack-based and index-based) do not provide efficient...
متن کاملFuzzy Multi-Join and Top-K Query Model for Search-As-You-Type in Multiple Tables
A search-as-you-type system determines answers on-the-fly as a user types in a keyword query, character by character. There arises a higher need to know the support search-as-you-type on data residing in a relational DBMS. The existing work on keyword query focuses on to support type of search using the native database SQL. The leverage existing database functionalities is to meet high performa...
متن کاملGuest Editors Introduction: Special Section on Keyword Search on Structured Data
WITH the prevalence of Web search engines, keyword search has become the most popular way for users to retrieve information from text documents. On the other hand, there is an enormous amount of valuable information stored in structured form (relational or semistructured) in Internet, intranet, and enterprise databases. To query such data sources, users traditionally depended on specialized app...
متن کاملSPARK: a keyword search system on relational databases
With the increasing usage of storing textual data into relational databases, there is a demand for the databases to support keyword queries over textual data. Due to the normalization and the inherent connections among tuples in different tables, traditional IR-style ranking and query evaluation methods do not apply. A number of systems have been proposed to deal with this issue. In this thesis...
متن کامل